On solving Travelling Salesman Problem with Vertex Requisitions
نویسندگان
چکیده
منابع مشابه
On Solving Travelling Salesman Problem with Vertex Requisitions
Abstract: We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has less time complexity compared to the previously known one. In particular, almost all feasible instances of the problem are solvable in O(n) time u...
متن کاملSolving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm
We present an improved hybrid genetic algorithm to solve the two-dimensional Euclidean traveling salesman problem (TSP), in which the crossover operator is enhanced with a local search. The proposed algorithm is expected to obtain higher quality solutions within a reasonable computational time for TSP by perfectly integrating GA and the local search. The elitist choice strategy, the local searc...
متن کاملFast Exact Method for Solving the Travelling Salesman Problem
Let apply this cutting procedure for ... 3 2 1 − − − → → N N N R R R sub-routes. One can readily see that there will be progressive increasing in the disturbances of sub-routes length, i.e. | ) ( ) ( | | ) ( ) ( | 1 1 − + − ≤ − k k k k R D R D R D R D , ,... 3 , 2 − − = N N k As result of application these transformations sequence, we should obtain N P r r r r R ∈ = 2 1 2 1 2 , }, , { sub-route...
متن کاملSolving Asymmetric Travelling Salesman Problem using Memetic Algorithm
Memetic Algorithms have been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for Asymmetric Traveling salesman problem (ATSP). Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. Because of perfor...
متن کاملSolving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2017
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor161012003e